,
ାଵ,ା
p
p
t scores of the cells one column on the right below the current
re 7.2 visualises these three moving directions of the update rule
he Needleman-Wunsch algorithm.
The moving directions of the update rule used in the Needleman algorithm.
7.7 shows how the algorithm works to align two sequences
rom the cell (5, 4). The last row and the last column did not need
e of the alignment scores. For the cell (5, 4), the alignment score
ulated as below, where there was no diagonal move. The
t for the cell (5, 4) was between C and C, hence ݏହ,ସൌ1.
nment score of the cell (6, 5) was one. Therefore the total score
ll (5, 4) was two.
ସൌݏହ,ସmax൛ܯ,ହ, ܰܣ, ܰܣൟൌ1 max ሼ1, ܰܣ, ܰܣሽൌ2
The alignment result for the cell (5, 4). The cells with bold number are the
alignments.
1
2
3
4
5
A
G
T
C
A
1
C
0
0
0
1
0
2
A
1
0
0
0
1
3
G
0
1
0
0
0
4
G
0
1
0
0
0
5
C
0
0
0
2
0
6
A
1
0
0
0
1
e cell (4, 2), the alignment score was calculated as below and the
t result is shown in Table 7.8, where ܯହ,ሺଷ,ସ,ହሻ was the maximum
t score of the cells (5, 3), (5, 4) and (5, 5).
